翻訳と辞書
Words near each other
・ Grotesque (novel)
・ Grotesque (The X-Files)
・ Grotesque body
・ Grotesque dance
・ Grotesque Impalement
・ Grotesque Wedlock
・ Grotesquerie
・ Groth
・ Grothe
・ Grothendieck category
・ Grothendieck connection
・ Grothendieck construction
・ Grothendieck duality
・ Grothendieck existence theorem
・ Grothendieck group
Grothendieck inequality
・ Grothendieck local duality
・ Grothendieck space
・ Grothendieck spectral sequence
・ Grothendieck topology
・ Grothendieck trace formula
・ Grothendieck universe
・ Grothendieck's connectedness theorem
・ Grothendieck's Galois theory
・ Grothendieck's relative point of view
・ Grothendieck's Tôhoku paper
・ Grothendieck–Katz p-curvature conjecture
・ Grothendieck–Ogg–Shafarevich formula
・ Grothendieck–Riemann–Roch theorem
・ Grothendieck–Teichmüller group


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Grothendieck inequality : ウィキペディア英語版
Grothendieck inequality
In mathematics, the Grothendieck inequality states that there is a universal constant ''k'' with the following property. If ''a''''i'',''j'' is an ''n'' by ''n'' (real or complex) matrix with
: \left| \sum_ a_ s_i t_j \right|\le 1
for all (real or complex) numbers ''s''''i'', ''t''''j'' of absolute value at most 1, then
: \left| \sum_ a_ \langle S_i , T_j \rangle \right|\le k,
for all vectors ''S''''i'', ''T''''j'' in the unit ball ''B''(''H'') of a (real or complex) Hilbert space ''H''. The smallest constant ''k'' which satisfies this property for all ''n'' by ''n'' matrices is called a Grothendieck constant and denoted ''k''(''n''). In fact there are two Grothendieck constants ''k''R(''n'') and ''k''C(''n'') for each ''n'' depending on whether one works with real or complex numbers, respectively.〔.〕
The Grothendieck inequality and Grothendieck constants are named after Alexander Grothendieck, who proved the inequality and the existence of the constants in a paper published in 1953.〔
==Bounds on the constants==
The sequences ''k''R(''n'') and ''k''C(''n'') are easily seen to be increasing, and Grothendieck's result states that they are bounded, so they have limits.
With ''k''R defined to be sup''n'' ''k''R(''n'') then Grothendieck proved that: 1.57 \approx \frac \leq k_ \leq \mathrm(\frac) \approx 2.3.
improved the result by proving: 1.67696... ≤ ''k''R ≤ 1.7822139781...= \frac, conjecturing that the upper bound is tight. However, this conjecture was disproved by .

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Grothendieck inequality」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.